One More Universality Result for P Systems with Objects on Membranes
نویسنده
چکیده
We continue here the attempt to bridge brane calculi with membrane computing, following the investigation started in [2]. Specifically, we consider P systems with objects placed on the membranes, and processed by membrane operations. The operations used in this paper are membrane creation (cre), and membrane dissolution (dis), defined in a way which reminds the operations pino, exo from a brane calculus from [1]. For P systems based on these operations we prove the universality, for one of the two possible variants of the operations; for the other variant the problem remains open.
منابع مشابه
Number of Protons/Bi-stable Catalysts and Membranes in P Systems. Time-Freeness
Proton pumping P systems are a variant of membrane systems with both rewriting rules and symport/antiport rules, where a set of objects called protons is distinguished, every cooperative symport or antiport rule involves a proton, but no rewriting rule does. Time-freeness property means the result of all computations does not depend on the time it takes to execute the rules. The goal of this ar...
متن کاملP Systems with Proteins on Membranes
This work is a continuation of the investigations aiming to bridge membrane computing (where in a compartmental cell-like structure the chemicals to evolve are placed in the compartments defined by the membranes) and brane calculi (where one considers again a compartmental cell-like structure with the chemicals/proteins placed on the membranes themselves). In the current paper we use objects bo...
متن کاملComputing with Genetic Gates, Proteins, and Membranes
We introduce Genetic P systems, a class of P systems with evolution rules inspired by the functioning of the genes. The creation of new objects – representing proteins – is driven by genetic gates: a new object is produced when all the activator objects are present, and no inhibitor object is available. Activator objects are not consumed by the application of such an evolution rule. Objects dis...
متن کاملP systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of membranes cannot grow, then in this framework we can characterize exactly the regular languages. If membrane creation or membrane division is allowed, then the Parikh sets of recursively enumerable languages can be gene...
متن کاملMembrane Systems with Limited Parallelism
Membrane computing is an emerging research field that belongs to the more general area of molecular computing, which deals with computational models inspired from bio-molecular processes. Membrane computing aims at defining models, called membrane systems or P systems, which abstract the functioning and structure of the cell. A membrane system consists of a hierarchical arrangement of membranes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005